Avoidability of Palindrome Patterns

We characterize the formulas that are avoided by every $\alpha$-free word for some $\alpha>1$. show avoidable whose fragments of form $XY$ or $XYX$ $4$-avoidable. The largest avoidability index an palindrome pattern is known to be at least $4$ and most $16$. make progress toward conjecture